Relating Tree Series Transducers and Weighted Tree Automata
نویسنده
چکیده
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-weighted tree automata (D-wta) with D a distributive Ω-algebra are introduced. A D-wta is essentially a wta but uses as transition weight an operation symbol of the Ω-algebra D instead of a semiring element. The given tst is implemented with the help of a D-wta, essentially showing that D-wta are a joint generalization of tst (using IO-substitution) and wta. Then a semiring and a wta are constructed such that the wta computes a formal representation of the semantics of the D-wta. The applicability of the obtained presentation result is demonstrated by deriving a pumping lemma for deterministic finite D-wta from a known pumping lemma for deterministic finite wta. Finally, it is observed that the known decidability results for emptiness cannot be applied to obtain decidability of emptiness for finite D-wta. Thus with help of a weaker version of the derived pumping lemma, decidability of the emptiness problem for finite D-wta is shown under mild conditions on D.
منابع مشابه
Series, Weighted Automata, Probabilistic Automata and Probability Distributions for Unranked Trees
We study tree series and weighted tree automata over unranked trees. The message is that recognizable tree series for unranked trees can be defined and studied from recognizable tree series for binary representations of unranked trees. For this we prove results of [1] as follows. We extend hedge automata – a class of tree automata for unranked trees – to weighted hedge automata. We define weigh...
متن کاملBottom-Up and Top-Down Tree Series Transformations
We generalize bottom-up tree transducers and top-down tree transducers to the concept of bottom-up tree series transducer and top-down tree series transducer, respectively, by allowing formal tree series as output rather than trees, where a formal tree series is a mapping from output trees to some semiring. We associate two semantics with a tree series transducer: a mapping which transforms tre...
متن کاملEfficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of inference algorithms for these automata beyond formal foundations. We give a detailed description of algorithms for application of cascades of weighted tree transducers to weighted tree acceptors, connecting formal the...
متن کاملHASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
The relationship between classes of tree-to-tree-series and o-tree-to-tree-series transformations, which are computed by restricted deterministic bottom-up weighted tree transducers, is investigated. Essentially, these transducers are deterministic bottom-up tree series transducers, except that the former are defined over monoids whereas the latter are defined over semirings and only use the mu...
متن کاملWeighted Tree-Walking Automata
We define weighted tree-walking automata. We show that the class of tree series recognizable by weighted tree-walking automata over a commutative semiring K is a subclass of the class of regular tree series over K. If K is not a ring, then the inclusion is strict.
متن کامل